In number theory, given a prime number , the -adic numbers form an extension of the that is distinct from the , though with some similar properties; -adic numbers can be written in a form similar to (possibly infinite) decimals, but with digits based on a prime number rather than ten, and extending to the left rather than to the right.
For example, comparing the expansion of the rational number in base vs. the -adic expansion,
Formally, given a prime number , a -adic number can be defined as a series
where is an integer (possibly negative), and each is an integer such that A -adic integer is a -adic number such that
In general the series that represents a -adic number is not convergent in the usual sense, but it is convergent for the -adic absolute value where is the least integer such that (if all are zero, one has the zero -adic number, which has as its -adic absolute value).
Every rational number can be uniquely expressed as the sum of a series as above, with respect to the -adic absolute value. This allows considering rational numbers as special -adic numbers, and alternatively defining the -adic numbers as the completion of the rational numbers for the -adic absolute value, exactly as the real numbers are the completion of the rational numbers for the usual absolute value.
-adic numbers were first described by Kurt Hensel in 1897, though, with hindsight, some of Ernst Kummer earlier work can be interpreted as implicitly using -adic numbers.[Translator's introduction, page 35: "Indeed, with hindsight it becomes apparent that a discrete valuation is behind Kummer's concept of ideal numbers." ]
Motivation
Roughly speaking, modular arithmetic modulo a positive integer consists of "approximating" every integer by the remainder of its division by , called its
residue modulo . The main property of modular arithmetic is that the residue modulo of the result of a succession of operations on integers is the same as the result of the same succession of operations on residues modulo .
When studying Diophantine equations, it's sometimes useful to reduce the equation modulo a prime , since this usually provides more insight about the equation itself. Unfortunately, doing this loses some information because the reduction is not injective.
One way to preserve more information is to use larger moduli, such as higher prime powers, , . However, this has the disadvantage of not being a field, which loses a lot of the algebraic properties that has.
Kurt Hensel discovered a method which consists of using a prime modulus , and applying Hensel's lemma to lift solutions modulo to modulo , . This process creates an infinite sequence of residues, and a -adic number is defined as the "limit" of such a sequence.
Essentially, -adic numbers allows "taking modulo for all at once". A distinguishing feature of -adic numbers from ordinary modulo arithmetic is that the set of -adic numbers forms a field, making division by possible (unlike when working modulo ). Furthermore, the mapping is injective, so not much information is lost when reducing to -adic numbers.
Informal description
There are multiple ways to understand -adic numbers.
As a base-p expansion
One way to think about -adic integers is using "base ". For example, every integer can be written in base ,
Informally, -adic integers can be thought of as integers in base-, but the digits extend infinitely to the left.
Addition and multiplication on -adic integers can be carried out similarly to integers in base-.
When adding together two -adic integers, for example , their digits are added with carries being propagated from right to left.
Multiplication of -adic integers works similarly via long multiplication. Since addition and multiplication can be performed with -adic integers, they form a ring, denoted or .
Note that some rational numbers can also be -adic integers, even if they aren't integers in a real sense. For example, the rational number is a 3-adic integer, and has the 3-adic expansion . However, some rational numbers, such as , cannot be written as a -adic integer. Because of this, -adic integers are generalized further to -adic numbers:
-adic numbers can be thought of as -adic integers with finitely many digits after the decimal point. An example of a 3-adic number is
Equivalently, every -adic number is of the form , where is a -adic integer.
For any -adic number , its multiplicative inverse is also a -adic number, which can be computed using a variant of long division. For this reason, the -adic numbers form a field, denoted or .
As a sequence of residues mod k
Another way to define -adic integers is by representing it as a sequence of residues
mod
for each integer
,
satisfying the compatibility relations for . In this notation, addition and multiplication of -adic integers are defined component-wise:
This is equivalent to the base- definition, because the last digits of a base- expansion uniquely define its value mod k, and vice versa.
This form can also explain why some rational numbers are -adic integers, even if they are not integers. For example, is a 3-adic integer, because its 3-adic expansion consists of the multiplicative inverses of 5 mod 3, 32, 33, ...
Definition
There are several equivalent definitions of -adic numbers. The two approaches given below are relatively elementary.
As formal series in base
A
-adic integer is often defined as a formal power series of the form
where each
represents a "digit in base ".
A -adic unit is a -adic integer whose first digit is nonzero, i.e. . The set of all -adic integers is usually denoted .
A -adic number is then defined as a formal Laurent series of the form
where is a (possibly negative) integer, and each . Equivalently, a -adic number is anything of the form , where is a -adic integer.
The first index for which the digit is nonzero in is called the p-adic valuation of , denoted . If , then such an index does not exist, so by convention .
In this definition, addition, subtraction, multiplication, and division of -adic numbers are carried out similarly to numbers in base , with "carries" or "borrows" moving from left to right rather than right to left. As an example in ,
Division of -adic numbers may also be carried out "formally" via division of formal power series, with some care about having to "carry".[
]
With these operations, the set of -adic numbers form a field, denoted .
As equivalence classes
The -adic numbers may also be defined as equivalence classes, in a similar way as the definition of real numbers as equivalence classes of Cauchy sequences. It is fundamentally based on the following lemma:
- Every nonzero rational number can be written where , , and are integers and neither nor is divisible by .
The exponent is uniquely determined by and is called its -adic valuation, denoted . The proof of the lemma results directly from the fundamental theorem of arithmetic.
A -adic series is a formal Laurent series of the form
where is a (possibly negative) integer and the are rational numbers that either are zero or have a nonnegative valuation (that is, the denominator of is not divisible by ).
Every rational number may be viewed as a -adic series with a single nonzero term, consisting of its factorization of the form with and both coprime with .
Two -adic series and
are equivalent if there is an integer such that, for every integer the rational number
is zero or has a -adic valuation greater than .
A -adic series is normalized if either all are integers such that